A Note on the Weiss Conjecture
نویسنده
چکیده
Let G be a finite group acting vertex-transitively on a graph. We show that bounding the order of a vertex stabilizer is equivalent to bounding the second singular value of a particular bipartite graph. This yields an alternative formulation of the Weiss Conjecture. 2010 Mathematics subject classification: primary 20B25; secondary 05C25.
منابع مشابه
A note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملThe Weiss conjecture and weak norms
In this note we show that for analytic semigroups the so-called Weiss condition of uniform boundedness of the operators Re(λ) 1/2C(λ+A)−1, Re(λ) > 0 on the complex right half plane and weak Lebesgue L2,∞–admissibility are equivalent. Moreover, we show that the weak Lebesgue norm is best possible in the sense that it is the endpoint for the ’Weiss conjecture’ within the scale of Lorentz spaces L...
متن کاملA Further Note on Runs in Independent Sequences
Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...
متن کاملNew Sheaf Theoretic Methods in Differential Topology
The Mumford conjecture predicts the ring of rational characteristic classes for surface bundles with oriented connected fibers of large genus. The first proof in [11] relied on a number of well known but difficult theorems in differential topology. Most of these difficult ingredients have been eliminated in the years since then. This can be seen particularly in [7] which has a second proof of t...
متن کاملA Note on the Road-Coloring Conjecture
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a graph is a road-coloring, are noted. Probabilistic analysis is then used to show that, if the outdegree of every edge in an n-vertex digraph is δ = ω(logn), a road-coloring for the graph exists. An equivalent re-statemen...
متن کامل